A New Binary PSO with Velocity Control
نویسندگان
چکیده
Particle Swarm Optimization (PSO) is a metaheuristic that is highly used to solve monoand multi-objective optimization problems. Two well-differentiated PSO versions have been defined – one that operates in a continuous solution space and one for binary spaces. In this paper, a new version of the Binary PSO algorithm is presented. This version improves its operation by a suitable positioning of the velocity vector. To achieve this, a new modified version of the continuous gBest PSO algorithm is used. The method proposed has been compared with two alternative methods to solve four known test functions. The results obtained have been satisfactory.
منابع مشابه
Optimization of RFM's Structure Using a New Reformulation of PSO in Case of Limited GCPs
Metaheuristic algorithms have been widely used in determining the optimum rational polynomial coefficients (RPCs). By eliminating a number of unnecessary RPCs, these algorithms increase the accuracy of geometric correction of high-resolution satellite images. To this end, these algorithms use ordinary least squares and a number of ground control points (GCPs) to determine RPCs' values. Due to t...
متن کاملDesign and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Runtime Analysis of Binary PSO
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and a swarm of particles. Each particle consists of a current position, an own best position and a velocity vector used in a probabilistic process to update the particle’s position. We present lower bounds for a broad cla...
متن کاملA New Cooperative PSO Approach with Landscape Estimation, Dimension Partition, and Velocity Control
Particle swarm optimization (PSO) has been proposed as an alternative to traditional evolutionary algorithms. Yet, more efficient strategies are still needed to control the trade-off between exploitation and exploration in the search process for solving complex tasks with high dimensional and multimodal objective functions. In this work, the authors propose a new PSO approach to overcome the se...
متن کاملRuntime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles searching for good solutions. Each particle consists of a current position from {0, 1}n, an own best position and a velocity vector used in a probabilistic process to update its current position. The velocities for a particl...
متن کاملA Comparison Between GA and PSO Algorithms in Training ANN to Predict the Refractive Index of Binary Liquid Solutions
A total of 1099 data points consisting of alcohol-alcohol, alcohol-alkane, alkane-alkane, alcohol-amine and acid-acid binary solutions were collected from scientific literature to develop an appropriate artificial neural network (ANN) model. Temperature, molecular weight of the pure components, mole fraction of one component and the structural groups of the components were used as input paramet...
متن کامل